Balancing Expression Dags for More Efficient Lazy Adaptive Evaluation
نویسنده
چکیده
Arithmetic expression dags are widely applied in robust geometric computing. In this paper we restructure expression dags by balancing consecutive additions or multiplications. We predict an asymptotic improvement in running time and experimentally confirm the theoretical results. Finally, we discuss some pitfalls of the approach resulting from changes in evaluation order.
منابع مشابه
Dynamic Hashing: Adaptive Metadata Management for Petabyte-scale File Systems∗
In a petabyte-scale file system, metadata access performance and scalability will significantly affect the whole system’s performance and scalability. We present a new approach called Dynamic Hashing (DH) for metadata management. DH introduces the RELAB (RElative LoAd Balancing) strategy to adjust the metadata distribution when the workload changes dynamically. Elasticity strategy is proposed t...
متن کاملLazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges
Motion-planning problems, such as manipulation in cluttered environments, often require a collision-free shortest path to be computed quickly given a roadmap graph G. Typically, the computational cost of evaluating whether an edge of G is collision-free dominates the running time of search algorithms. Algorithms such as Lazy Weighted A* (LWA*) and LazySP have been proposed to reduce the number ...
متن کاملA Note on three Programming Paradigms
This paper is about a puzzle to be solved in three programming paradigms: logic, functional and imperative. It can be considered as a case study of algorithm inversion, since we start with logic algorithm, that answers the question “Is balancing M times sufficient for detecting a single fake in a set of coins?”, and finishes with imperative algorithm, that effectively computes the minimal numbe...
متن کاملLazy Evaluation Schemes for Efficient Implementation of Multi-Context Algebraic Completion System
Lazy evaluation is a computational scheme which delays the evaluation of an expression until its value is needed, trying to improve the performance particularly when dealing with large data structure. In this paper, we apply this mechanism to a multi-context algebraic reasoning system which, on a large data structure called the nodes, efficiently simulates parallel processes each executing an a...
متن کاملOn the Use of Adaptive, Exact Decisions Number Types Based on Expression-Dags in Geometric Computing
We discuss how (not) to use number types based on expression dags and adaptive precision in geometric computing. Such number types provide exact decisions for (a subset of the) real algebraic numbers.
متن کامل